Control Strategies in HTN Planning: Theory Versus Practice

نویسندگان

  • Dana S. Nau
  • Stephen J. J. Smith
  • Kutluhan Erol
چکیده

AI planning techniques are beginning to find use in a number of practical planning domains. However, the backward-chaining and partial-order-planning control strategies traditionally used in AI planning systems are not necessarily the best ones to use for practical planning problems. In this paper, we discuss some of the difficulties that can result from the use of backward chaining and partial-order planning, and we describe how these difficulties can be overcome by adapting Hierarchical Task-Network (HTN) planning to use a total-order control strategy that generates the steps of a plan in the same order that those steps will be executed. We also examine how introducing the total-order restriction into HTN planning affects its expressive power, and propose a way to relax the total-order restriction to increase its expressive power and range of applicability.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Feasibility of Planning Graph Style Heuristics for HTN Planning

In classical planning, the polynomial-time computability of propositional delete-free planning (planning with only positive effects and preconditions) led to the highly successful Relaxed Graphplan heuristic. We present a hierarchy of new computational complexity results for different classes of propositional delete-free HTN planning, with two main results: We prove that finding a plan for the ...

متن کامل

Translating Evidence into Healthcare Policy and Practice: Single Versus Multi-Faceted Implementation Strategies – Is There a Simple Answer to a Complex Question?

How best to achieve the translation of research evidence into routine policy and practice remains an enduring challenge in health systems across the world. The complexities associated with changing behaviour at an individual, team, organizational and system level have led many academics to conclude that tailored, multifaceted strategies provide the most effective approach to knowledge translati...

متن کامل

Title of Dissertation: Eecient Reenement Strategies for Htn Planning Eecient Reenement Strategies for Htn Planning

Title of Dissertation: E cient Re nement Strategies for HTN Planning Reiko Tsuneto, Doctor of Philosophy, 1999 Dissertation directed by: Professor James Hendler Department of Computer Science Professor Dana Nau Department of Computer Science The e ciency of planning greatly depends on the type of re nement strategy the planner uses, but little is understood about the conditions under which each...

متن کامل

Bound to Plan: Exploiting Classical Heuristics via Automatic Translations of Tail-Recursive HTN Problems

Hierarchical Task Network (HTN) planning is a formalism that can express constraints which cannot easily be expressed by classical (non-hierarchical) planning approaches. It enables reasoning about procedural structures and domainspecific search control knowledge. Yet the cornucopia of modern heuristic search techniques remains largely unincorporated in current HTN planners, in part because it ...

متن کامل

HTN Planning with Quantitative Preferences via Heuristic Search

In this paper, we address the problem of generating preferred plans by combining the procedural control knowledge specified by Hierarchical Task Networks (HTNs) with rich user preferences. To this end, we extend the popular Plan Domain Description Language, PDDL3, to support specification of preferences over HTN constructs. To compute preferred HTN plans, we propose a branch-and-bound algorithm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998